Online scheduling with general machine cost functions
نویسندگان
چکیده
منابع مشابه
Online scheduling with general cost functions
We consider a general online scheduling problem on a single machine with the objective of minimizing ∑ j wjg(Fj), where wj is the weight/importance of job Jj , Fj is the flow time of the job in the schedule, and g is an arbitrary non-decreasing cost function. Numerous natural scheduling objectives are special cases of this general objective. We show that the scheduling algorithm Highest Density...
متن کاملOnline scheduling with machine cost and rejection
In this paper we define and investigate a new scheduling model. In this new model the number of machines is not fixed; the algorithm has to purchase the used machines, moreover the jobs can be rejected. We show that the simple combinations of the algorithms used in the area of scheduling with rejections and the area of scheduling with machine cost are not constant competitive. We present a 2.61...
متن کاملOptimal Semi-online Algorithms for Scheduling with Machine Activation Cost
We investigate the following two semi-on-line scheduling problems with machine activation cost. We are given two potential identical machines to non-preemptively process a sequence of independent jobs. Machines need to be activated before starting to process, and each machine activated incurs a fixed machine activation cost. No machines are initially activated, and when a job is revealed the al...
متن کاملA note on "Single-machine scheduling with general learning functions"
The recent paper ‘‘Single-machine scheduling with general learning functions’’ (Wang [1]) addresses the single-machine scheduling problems with a sum-of-processing-times-based learning effect. The author showed that that the shortest processing time (SPT) rule is optimal for the sum of completion times square minimization problem. He also showed by examples that the optimal schedule for the cla...
متن کاملOnline Parallel Machine Scheduling With Hard Deadlines
This paper considers the problem of online job scheduling on M identical machines with hard deadlines. The processing time and delay time of a job are known only on its arrival. Jobs are discarded if they do not meet delay time requirement. The objective of the present work is to minimize the number of tardy jobs. A lower bound of competitive ratio when the processing time and delay time are bo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2009
ISSN: 0166-218X
DOI: 10.1016/j.dam.2007.10.014